Bisimulation and Propositional Intuitionistic Logic

نویسنده

  • Anna Patterson
چکیده

The Brouwer-Heyting-Kolmogorov interpretation of intuition-istic logic suggests that p q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every nite canonical model of q contains a nite canonical model of p. If q and p are interderivable, their canonical models contain each other. Using this insight, we are able to characterize validity in a Kripke structure in terms of bisimilarity. Theorem 1 Let K be a nite Kripke structure for propositional intu-itionistic logic, then two worlds in K are bisimilar if and only if they satisfy the same set of formulas. This theorem lifts to structures in the following manner. Theorem 2 Two nite Kripke structures K and K 0 are bisimilar if and only if they have the same set of valid formulas. We then generalize these results to a variety of innnite structures; nite principal lter structures and saturated structures. 1 Background The standard model theory for intuitionistic logic (Heyting 1966) was introduced by Kripke (1965). This model theory was originally introduced as a characterization of modal logics (Kripke 1963). A natural question that arises for any model theory is characterizing when two models satisfy the same set of formulas. A partial answer to this for modal logics was given by van Benthem, who showed that for well behaved modal structures the notion of bisimulation was appropriate. We now apply the same techniques to intuitionistic logic. Although intuition-istic logic is not a traditional modal logic we can use the relationship between S4 and topology to provide a bridge. The algebra of S4 (Lewis and Langford 1932) is a topological Boolean algebra (McKinsey and Tarski 1944) where the modality 2 can be taken to be an interior operation and the modality 3 is taken to be a closure operation (McKinsey 1941, Rasiowa and Sikorski 1963). It is well known (Birkhoo 1948) that the open subsets of a topological Boolean algebra form a relatively pseudo-complemented lattice. However, a relatively pseudo-complemented lattice with 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-Theoretic characterization of intuitionistic Propositional Formulas

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of...

متن کامل

Neighborhood Semantics for Basic and Intuitionistic Logic

In this paper we present a neighborhood semantics for Intuitionistic Propositional Logic (IPL). We show that for each Kripke model of the logic there is a pointwise equivalent neighborhood model and vice versa. In this way, we establish soundness and completeness of IPL with respect to the neighborhood semantics. The relation between neighborhood and topological semantics are also investigated....

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Bisimulation Quantified Logics: Undecidability

In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...

متن کامل

A Characterisation of Open Bisimulation using an Intuitionistic Modal Logic

Open bisimulation is the greatest bisimulation congruence for the π-calculus. In open bisimulation, free names in processes are treated as variables that may be instantiated; in contrast to late bisimulation where free names are constants. An established modal logic due to Milner, Parrow, and Walker characterises late bisimulation, that is, two processes satisfy the same set of formulae if and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997